Decomposition of k-ary relations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generic Disjunctive/Conjunctive Decomposition Model for n-ary Relations.

This paper discusses a generic decomposition model that represents an arbitrary n-ary relation as a disjunctive or conjunctive combination of a number of n-ary component relations of a prespecified type. An important subclass of order-preserving decompositions is defined and its properties are derived. The generic model is shown to subsume various known models as special cases, including the mo...

متن کامل

On the $k$-ary ‎M‎oment Map

The moment map is a mathematical expression of the concept of the conservation associated with the symmetries of a Hamiltonian system. The abstract moment map is defined from G-manifold M to dual Lie algebra of G. We will interested study maps from G-manifold M to spaces that are more general than dual Lie algebra of G. These maps help us to reduce the dimension of a manifold much more.

متن کامل

Application of fundamental relations on n-ary polygroups

The class of  $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and  a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...

متن کامل

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

On the decomposition of k-valued rational relations (Preliminary draft)

We give a new and hopefully more easily understandable structural proof for the decomposition of a k-valued transducer into k unambiguous functional transducers, a result established by A. Weber. The number of states of the transducers given by our construction outperforms Weber’s one by one exponential. Moreover, we solve a problem left open by Weber, the decomposition of a bounded length-degr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1990

ISSN: 0012-365X

DOI: 10.1016/0012-365x(90)90067-r